Accepting Programmed Grammars without Nonterminals
نویسنده
چکیده
منابع مشابه
Accepting Grammars and Systems
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In some cases, accepting mode turns out to be j...
متن کاملAccepting Pure Grammars and Systems
We consider several types of pure grammars and systems as language acceptors and compare them to their generating counterparts. In contrast with the case (considered in earlier papers of the authors) encountered when admitting nonterminals in these classical string rewriting mechanisms , we get incomparability results between language families generated and accepted by numerous types of pure gr...
متن کاملAccepting Grammars and Systems: An Overview
We investigate several kinds of regulated rewriting (matrix, ordered, programmed, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In a lot of cases, accepting mode turns out to be exactly as powerful...
متن کاملGraph-Controlled Grammars as Language Acceptors
In this paper, we study the concept of accepting grammars within various forms of regulated grammars like programmed grammars, matrix (set) grammars, grammars with regular (set) control, periodically time-variant grammars as variants of grammars controlled by bi-coloured digraphs. We focus on their descriptive capacity. In this way, we continue our studies of accepting grammars 1, 2, 3, 11, 13,...
متن کاملNonterminal complexity of tree controlled grammars
This paper studies the nonterminal complexity of tree controlled grammars. It is proved that the number of nonterminals in tree controlled grammars without erasing rules leads to an infinite hierarchy of families of tree controlled languages, while every recursively enumerable language can be generated by a tree controlled grammar with erasing rules and at most nine nonterminals. © 2011 Elsevie...
متن کامل